top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
An evaluation of visual search behavior on a cathode ray tube utilizing the window technique / / Thomas M. Granda
An evaluation of visual search behavior on a cathode ray tube utilizing the window technique / / Thomas M. Granda
Autore Granda Thomas M.
Pubbl/distr/stampa Alexandria, VA : , : U. S. Army Research Institute for the Behavioral and Social Sciences, , February 1978
Descrizione fisica 1 online resource (7 unnumbered pages, 53, 6 pages) : illustrations
Collana Technical paper
Soggetto topico Search theory
Visual perception
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910704115303321
Granda Thomas M.  
Alexandria, VA : , : U. S. Army Research Institute for the Behavioral and Social Sciences, , February 1978
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Introduction to stochastic search and optimization : estimation, simulation, and control / / James C. Spall
Introduction to stochastic search and optimization : estimation, simulation, and control / / James C. Spall
Autore Spall James C.
Pubbl/distr/stampa Hoboken, N.J. : , : Wiley-Interscience, , 2003
Descrizione fisica 1 online resource (620 pages)
Disciplina 519.23
Collana Wiley-Interscience series in discrete mathematics and optimization
Soggetto topico Stochastic processes
Search theory
Mathematical optimization
ISBN 1-280-25282-0
9786610252824
0-470-34845-3
0-471-44190-2
0-471-72213-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Stochastic Search and Optimization: Motivation and Supporting Results -- 2. Direct Methods for Stochastic Search -- 3. Recursive Estimation for Linear Models -- 4. Stochastic Approximation for Nonlinear Root-Finding -- 5. Stochastic Gradient Form of Stochastic Approximation -- 6. Stochastic Approximation and the Finite-Difference Method -- 7. Simultaneous Perturbation Stochastic Approximation -- 8. Annealing-Type Algorithms -- 9. Evolutionary Computation I: Genetic Algorithms -- 10. Evolutionary Computation II: General Methods and Theory -- 11. Reinforcement Learning via Temporal Differences -- 12. Statistical Methods for Optimization in Discrete Problems -- 13. Model Selection and Statistical Information -- 14. Simulation-Based Optimization I: Regeneration, Common Random Numbers, and Selection Methods -- 15. Simulation-Based Optimization II: Stochastic Gradient and Sample Path Methods -- 16. Markov Chain Monte Carlo -- 17. Optimal Design for Experimental Inputs.
Record Nr. UNINA-9910146070403321
Spall James C.  
Hoboken, N.J. : , : Wiley-Interscience, , 2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Introduction to stochastic search and optimization : estimation, simulation, and control / / James C. Spall
Introduction to stochastic search and optimization : estimation, simulation, and control / / James C. Spall
Autore Spall James C.
Pubbl/distr/stampa Hoboken, N.J. : , : Wiley-Interscience, , 2003
Descrizione fisica 1 online resource (620 pages)
Disciplina 519.23
Collana Wiley-Interscience series in discrete mathematics and optimization
Soggetto topico Stochastic processes
Search theory
Mathematical optimization
ISBN 1-280-25282-0
9786610252824
0-470-34845-3
0-471-44190-2
0-471-72213-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Stochastic Search and Optimization: Motivation and Supporting Results -- 2. Direct Methods for Stochastic Search -- 3. Recursive Estimation for Linear Models -- 4. Stochastic Approximation for Nonlinear Root-Finding -- 5. Stochastic Gradient Form of Stochastic Approximation -- 6. Stochastic Approximation and the Finite-Difference Method -- 7. Simultaneous Perturbation Stochastic Approximation -- 8. Annealing-Type Algorithms -- 9. Evolutionary Computation I: Genetic Algorithms -- 10. Evolutionary Computation II: General Methods and Theory -- 11. Reinforcement Learning via Temporal Differences -- 12. Statistical Methods for Optimization in Discrete Problems -- 13. Model Selection and Statistical Information -- 14. Simulation-Based Optimization I: Regeneration, Common Random Numbers, and Selection Methods -- 15. Simulation-Based Optimization II: Stochastic Gradient and Sample Path Methods -- 16. Markov Chain Monte Carlo -- 17. Optimal Design for Experimental Inputs.
Record Nr. UNINA-9910677500903321
Spall James C.  
Hoboken, N.J. : , : Wiley-Interscience, , 2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Autore Kagan Eugene
Pubbl/distr/stampa Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Descrizione fisica 1 online resource (348 p.)
Disciplina 658.5/3
670.285
Altri autori (Persone) Ben-GalIrad
Soggetto topico Search theory
Target acquisition - Mathematics
Motion - Mathematical models
ISBN 1-118-59659-5
1-118-59704-4
1-299-44937-9
1-118-59710-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Copyright; Contents; List of figures; Preface; Notation and terms; Chapter 1 Introduction; 1.1 Motivation and applications; 1.2 General description of the search problem; 1.3 Solution approaches in the literature; 1.4 Methods of local search; 1.5 Objectives and structure of the book; References; Chapter 2 Problem of search for static and moving targets; 2.1 Methods of search and screening; 2.1.1 General definitions and notation; 2.1.2 Target location density for a Markovian search; 2.1.3 The search-planning problem; 2.2 Group-testing search
2.2.1 General definitions and notation2.2.2 Combinatorial group-testing search for static targets; 2.2.3 Search with unknown number of targets and erroneous observations; 2.2.4 Basic information theory search with known location probabilities; 2.3 Path planning and search over graphs; 2.3.1 General BF* and A* algorithms; 2.3.2 Real-time search and learning real-time A* algorithm; 2.3.3 Moving target search and the fringe-retrieving A* algorithm; 2.4 Summary; References; Chapter 3 Models of search and decision making; 3.1 Model of search based on MDP; 3.1.1 General definitions
3.1.2 Search with probabilistic and informational decision rules3.2 Partially observable MDP model and dynamic programming approach; 3.2.1 MDP with uncertain observations; 3.2.2 Simple Pollock model of search; 3.2.3 Ross model with single-point observations; 3.3 Models of moving target search with constrained paths; 3.3.1 Eagle model with finite and infinite horizons; 3.3.2 Branch-and-bound procedure of constrained search with single searcher; 3.3.3 Constrained path search with multiple searchers; 3.4 Game theory models of search; 3.4.1 Game theory model of search and screening
3.4.2 Probabilistic pursuit-evasion games3.4.3 Pursuit-evasion games on graphs; 3.5 Summary; References; Chapter 4 Methods of information theory search; 4.1 Entropy and informational distances between partitions; 4.2 Static target search: Informational LRTA* algorithm; 4.2.1 Informational LRTA* algorithm and its properties; 4.2.2 Group-testing search using the ILRTA* algorithm; 4.2.3 Search by the ILRTA* algorithm with multiple searchers; 4.3 Moving target search: Informational moving target search algorithm; 4.3.1 The informational MTS algorithm and its properties
4.3.2 Simple search using the IMTS algorithm4.3.3 Dependence of the IMTS algorithm's actions on the target's movement; 4.4 Remarks on programming of the ILRTA* and IMTS algorithms; 4.4.1 Data structures; 4.4.2 Operations and algorithms; 4.5 Summary; References; Chapter 5 Applications and perspectives; 5.1 Creating classification trees by using the recursive ILRTA* algorithm; 5.1.1 Recursive ILRTA* algorithm; 5.1.2 Recursive ILRTA* with weighted distances and simulation results; 5.2 Informational search and screening algorithm with single and multiple searchers
5.2.1 Definitions and assumptions
Record Nr. UNINA-9910139034303321
Kagan Eugene  
Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Autore Kagan Eugene
Pubbl/distr/stampa Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Descrizione fisica 1 online resource (348 p.)
Disciplina 658.5/3
670.285
Altri autori (Persone) Ben-GalIrad
Soggetto topico Search theory
Target acquisition - Mathematics
Motion - Mathematical models
ISBN 1-118-59659-5
1-118-59704-4
1-299-44937-9
1-118-59710-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Copyright; Contents; List of figures; Preface; Notation and terms; Chapter 1 Introduction; 1.1 Motivation and applications; 1.2 General description of the search problem; 1.3 Solution approaches in the literature; 1.4 Methods of local search; 1.5 Objectives and structure of the book; References; Chapter 2 Problem of search for static and moving targets; 2.1 Methods of search and screening; 2.1.1 General definitions and notation; 2.1.2 Target location density for a Markovian search; 2.1.3 The search-planning problem; 2.2 Group-testing search
2.2.1 General definitions and notation2.2.2 Combinatorial group-testing search for static targets; 2.2.3 Search with unknown number of targets and erroneous observations; 2.2.4 Basic information theory search with known location probabilities; 2.3 Path planning and search over graphs; 2.3.1 General BF* and A* algorithms; 2.3.2 Real-time search and learning real-time A* algorithm; 2.3.3 Moving target search and the fringe-retrieving A* algorithm; 2.4 Summary; References; Chapter 3 Models of search and decision making; 3.1 Model of search based on MDP; 3.1.1 General definitions
3.1.2 Search with probabilistic and informational decision rules3.2 Partially observable MDP model and dynamic programming approach; 3.2.1 MDP with uncertain observations; 3.2.2 Simple Pollock model of search; 3.2.3 Ross model with single-point observations; 3.3 Models of moving target search with constrained paths; 3.3.1 Eagle model with finite and infinite horizons; 3.3.2 Branch-and-bound procedure of constrained search with single searcher; 3.3.3 Constrained path search with multiple searchers; 3.4 Game theory models of search; 3.4.1 Game theory model of search and screening
3.4.2 Probabilistic pursuit-evasion games3.4.3 Pursuit-evasion games on graphs; 3.5 Summary; References; Chapter 4 Methods of information theory search; 4.1 Entropy and informational distances between partitions; 4.2 Static target search: Informational LRTA* algorithm; 4.2.1 Informational LRTA* algorithm and its properties; 4.2.2 Group-testing search using the ILRTA* algorithm; 4.2.3 Search by the ILRTA* algorithm with multiple searchers; 4.3 Moving target search: Informational moving target search algorithm; 4.3.1 The informational MTS algorithm and its properties
4.3.2 Simple search using the IMTS algorithm4.3.3 Dependence of the IMTS algorithm's actions on the target's movement; 4.4 Remarks on programming of the ILRTA* and IMTS algorithms; 4.4.1 Data structures; 4.4.2 Operations and algorithms; 4.5 Summary; References; Chapter 5 Applications and perspectives; 5.1 Creating classification trees by using the recursive ILRTA* algorithm; 5.1.1 Recursive ILRTA* algorithm; 5.1.2 Recursive ILRTA* with weighted distances and simulation results; 5.2 Informational search and screening algorithm with single and multiple searchers
5.2.1 Definitions and assumptions
Record Nr. UNINA-9910813432503321
Kagan Eugene  
Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Search games / Shmuel Gal
Search games / Shmuel Gal
Autore Gal, Shmuel
Pubbl/distr/stampa New York : Academic Press, 1980
Descrizione fisica xiv, 216 p. : ill. ; 24 cm
Disciplina 001.424
Collana Mathematics in science and engineering. A series of monographs and textbooks, 0076-5392 ; 149
Soggetto topico Game theory
Search theory
ISBN 0122738500
Classificazione AMS 90D
T57.97
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991001320199707536
Gal, Shmuel  
New York : Academic Press, 1980
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
The theory of search games and rendezvous [[electronic resource] /] / by Steve Alpern, Shmuel Gal
The theory of search games and rendezvous [[electronic resource] /] / by Steve Alpern, Shmuel Gal
Autore Alpern Steve <1948->
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Boston, : Kluwer Academic Publishers, c2003
Descrizione fisica 1 online resource (336 p.)
Disciplina 003
Altri autori (Persone) GalShmuel
Collana International series in operations research & management science
Soggetto topico Search theory
Game theory
Soggetto genere / forma Electronic books.
ISBN 1-280-60847-1
9786610608478
0-306-48212-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Search Games -- to Search Games -- Search Games in Compact Spaces -- General Framework -- Search for an Immobile Hider -- Search for a Mobile Hider -- Miscellaneous Search Games -- Search Games in Unbounded Domains -- General Framework -- On Minimax Properties of Geometric Trajectories -- Search on the Infinite Line -- Star and Plan Search -- Rendezvous Search -- to Rendezvous Search -- Elementary Results and Examples -- Rendezvous Search on Compact Spaces -- Rendezvous Values of a Compact Symmetric Region -- Rendezvous on Labeled Networks -- Asymmetric Rendezvous on an Unlabeled Circle -- Rendezvous on a Graph -- Rendezvous Search on Unbounded Domains -- Asymmetric Rendezvous on the Line (ARPL) -- Other Rendezvous Problems on the Line -- Rendezvous in Higher Dimensions.
Record Nr. UNINA-9910456200703321
Alpern Steve <1948->  
Boston, : Kluwer Academic Publishers, c2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The theory of search games and rendezvous [[electronic resource] /] / by Steve Alpern, Shmuel Gal
The theory of search games and rendezvous [[electronic resource] /] / by Steve Alpern, Shmuel Gal
Autore Alpern Steve <1948->
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Boston, : Kluwer Academic Publishers, c2003
Descrizione fisica 1 online resource (336 p.)
Disciplina 003
Altri autori (Persone) GalShmuel
Collana International series in operations research & management science
Soggetto topico Search theory
Game theory
ISBN 1-280-60847-1
9786610608478
0-306-48212-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Search Games -- to Search Games -- Search Games in Compact Spaces -- General Framework -- Search for an Immobile Hider -- Search for a Mobile Hider -- Miscellaneous Search Games -- Search Games in Unbounded Domains -- General Framework -- On Minimax Properties of Geometric Trajectories -- Search on the Infinite Line -- Star and Plan Search -- Rendezvous Search -- to Rendezvous Search -- Elementary Results and Examples -- Rendezvous Search on Compact Spaces -- Rendezvous Values of a Compact Symmetric Region -- Rendezvous on Labeled Networks -- Asymmetric Rendezvous on an Unlabeled Circle -- Rendezvous on a Graph -- Rendezvous Search on Unbounded Domains -- Asymmetric Rendezvous on the Line (ARPL) -- Other Rendezvous Problems on the Line -- Rendezvous in Higher Dimensions.
Record Nr. UNINA-9910780214403321
Alpern Steve <1948->  
Boston, : Kluwer Academic Publishers, c2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The theory of search games and rendezvous [[electronic resource] /] / by Steve Alpern, Shmuel Gal
The theory of search games and rendezvous [[electronic resource] /] / by Steve Alpern, Shmuel Gal
Autore Alpern Steve <1948->
Edizione [1st ed. 2003.]
Pubbl/distr/stampa Boston, : Kluwer Academic Publishers, c2003
Descrizione fisica 1 online resource (336 p.)
Disciplina 003
Altri autori (Persone) GalShmuel
Collana International series in operations research & management science
Soggetto topico Search theory
Game theory
ISBN 1-280-60847-1
9786610608478
0-306-48212-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Search Games -- to Search Games -- Search Games in Compact Spaces -- General Framework -- Search for an Immobile Hider -- Search for a Mobile Hider -- Miscellaneous Search Games -- Search Games in Unbounded Domains -- General Framework -- On Minimax Properties of Geometric Trajectories -- Search on the Infinite Line -- Star and Plan Search -- Rendezvous Search -- to Rendezvous Search -- Elementary Results and Examples -- Rendezvous Search on Compact Spaces -- Rendezvous Values of a Compact Symmetric Region -- Rendezvous on Labeled Networks -- Asymmetric Rendezvous on an Unlabeled Circle -- Rendezvous on a Graph -- Rendezvous Search on Unbounded Domains -- Asymmetric Rendezvous on the Line (ARPL) -- Other Rendezvous Problems on the Line -- Rendezvous in Higher Dimensions.
Record Nr. UNINA-9910815294803321
Alpern Steve <1948->  
Boston, : Kluwer Academic Publishers, c2003
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui